An exactly solvable random satisfiability problem
نویسندگان
چکیده
We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions of the SAT/UNSAT transition are calculable at zero temperature, with no need of replicas, also with exact finite-size corrections. We also introduce an exact duality of the model, and show an analogy of thermodynamic properties with the Random Energy Model of disordered spin systems theory. Relations with Error-Correcting Codes are also discussed. PACS: 89.80.+h, 75.10.Nr keywords: Random satisfiability, Random Energy Model, error-correcting codes, hyper-graphs, random linear systems.
منابع مشابه
Exact Algorithms for Exact Satisfiability Problems
This thesis presents exact means for solving a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (Xsat) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. While developing exact algorithms to solve the problems, we gain new insights into their structure and mutual similarities and differences...
متن کاملSimplest random K-satisfiability problem
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of gammaN random boolean constraints which are to be satisfied simultaneously by N logical variables. In statistical-mechanics language, the considered model can be seen as a diluted p-spin model at zero temperature. While such problems become extraordinarily hard to solve by local s...
متن کاملv 1 1 0 O ct 1 99 5 Quasi - exactly solvable problems and random matrix theory
There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing topological (1/N) expansions in random matrix models to the problem of constructing semiclassical expansions for observ-ables in quasi-exactly solvable problems. Lie a...
متن کاملRandom subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random ksatisfiability and k-coloring problems, and undergoes the same phase transitions as these problems. The comparison becomes quantitative in the large-k limit. Distance properties, as well t...
متن کاملQuasi-exactly solvable problems and random matrix theory
There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing topological (1/N) expansions in random matrix models to the problem of constructing semiclassical expansions for observables in quasi-exactly solvable problems. Lie al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002